Pinned distance sets, Wolff’s exponent in finite fields and improved sum-product estimates

نویسندگان

  • Derrick Hart
  • Alex Iosevich
  • Doowon Koh
چکیده

An analog of the Falconer distance problem in vector spaces over finite fields asks for the threshold α > 0 such that |∆(E)| & q whenever |E| & q, where E ⊂ Fq , the d-dimensional vector space over a finite field with q elements (not necessarily prime). Here ∆(E) = {(x1 − y1) 2 + · · ·+ (xd − yd) 2 : x, y ∈ E}. The second listed author and Misha Rudnev ([4]) established the threshold d+1 2 , and in [3] the authors of this paper, Doowon Koh and Misha Rudnev proved that this exponent is sharp in even dimensions. In this paper we improve the threshold to d 2 2d−1 under the additional assumption that E has product structure. In particular, we obtain the exponent 4 3 , consistent with the corresponding exponent in Euclidean space obtained by Wolff ([9]).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pinned distance sets, k-simplices, Wolff’s exponent in finite fields and sum-product estimates

An analog of the Falconer distance problem in vector spaces over finite fields asks for the threshold α > 0 such that |∆(E)| & q whenever |E| & q, where E ⊂ Fq , the d-dimensional vector space over a finite field with q elements (not necessarily prime). Here ∆(E) = {(x1 − y1) 2 + · · · + (xd − yd) 2 : x, y ∈ E}. The fourth listed author and Misha Rudnev ([20]) established the threshold d+1 2 , ...

متن کامل

The generalized Erdös-Falconer distance problems in vector spaces over finite fields

In this paper we study the generalized Erdös-Falconer distance problems in the finite field setting. The generalized distances are defined in terms of polynomials, and various formulas for sizes of distance sets are obtained. In particular, we develop a simple formula for estimating the cardinality of distance sets determined by diagonal polynomials. As a result, we generalize the spherical dis...

متن کامل

Averages over hyperplanes, sum-product theory in vector spaces over finite fields and the Erdős-Falconer distance conjecture

We prove a point-wise and average bound for the number of incidences between points and hyper-planes in vector spaces over finite fields. While our estimates are, in general, sharp, we observe an improvement for product sets and sets contained in a sphere. We use these incidence bounds to obtain significant improvements on the arithmetic problem of covering Fq, the finite field with q elements,...

متن کامل

Invited Addresses

We consider frames and Bessel systems generated by iterations of the form {Ag : g ∈ G, 0 ≤ n < L(g)}, where A is a bounded linear operators on a separable complex Hilbert space H and G is a countable set of vectors in H. The system of iterations mentioned above come from the so called dynamical sampling problem. In dynamical sampling, an unknown function f and its future states Af are coarsely ...

متن کامل

Sum-product Estimates in Finite Fields via Kloosterman Sums

We establish improved sum-product bounds in finite fields using incidence theorems based on bounds for classical Kloosterman and related sums.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008